Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games

نویسنده

  • Jerzy Marcinkowski
چکیده

In 1974 Ronald Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form 9 ~ P, where ~ P is a tuple of relation symbols. and is a rst order formula. Fagin was also the rst to study monadic NP: the class of properties expressible by existential second order sentences where all quantiied relations are unary. In their very diicult paper AF90] Ajtai and Fagin show that directed reachability is not in monadic NP. In AFS97] Ajtai, Fagin and Stockmeyer introduce closed monadic NP: the class of properties which can be expressed by a kind of monadic second order existential formula, where the second order quantiiers can interleave with rst order quantiiers. Among other results they show that directed reachability is expressible by a formula of the form 9P8x9P 1 ; P 2 , where P; P 1 ; P 2 are unary relation symbols and is rst order. They state the question if this property is in the rst order closure of monadic NP, that is if it is expressible by a sentence of the form ~ Qx9 ~ P, where ~ Qx is a tuple of rst order quantiiers and ~ P is a tuple of unary relation symbols. In this paper we give a negative solution to the problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Winning Strategies in Ehrenfeucht-Fraïssé Games

We present a powerful and versatile new suucient condition for the second player (the \duplicator") to have a winning strategy in an Ehrenfeucht-Fra ss e game on graphs. We accomplish two things with this technique. First, we give a simpler and much easier-to-understand proof of Ajtai and Fagin's result that reachability in directed nite graphs is not in monadic NP. (Monadic NP, otherwise known...

متن کامل

Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version)

Although it is known that reachability in undirected finite graphs can be expressed by an existential monadic second-order sentence, our main result is that this is not the case for directed finite graphs (even in the presence of certain “built-in” relations, such as the successor relation). The proof makes use of Ehrenfeucht-Frai’sse games, along with probabilistic arguments. However, we show ...

متن کامل

On winning strategies in Ehrenfeucht-Frai’ssk games

We present a powerful and versatile new sufficient condition for the second player (the “duplicator”) to have a winning strategy in an Ehrenfeucht-Fra’isst game on graphs. We accomplish two things with this technique. First, we give a simpler and much easier-to-understand proof of Ajtai and Fagin’s result that reachability in directed finite graphs is not in monadic NP. (Monadic NP, otherwise k...

متن کامل

On Monadic NP vs. Monadic co-NP

It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic (1 ;). Monadic NP is the class of problems expressible in monadic Z;, i.e., 1: with the restriction that the second-order quantifiers range only over sets (as opposed to ranging over, say, binary relations). We prove that connectivity of finite graph...

متن کامل

On Limitations of the Ehrenfeucht-Fraı̈ssé-method in Descriptive Complexity

Ehrenfeucht-Fraı̈ssé games and their generalizations have been quite successful in finite model theory and yield various inexpressibility results. However, for key problems such as P 6= NP or NP 6= co-NP no progress has been achieved using the games. We show that for these problems it is already hard to get the board for the corresponding Ehrenfeucht-Fraı̈ssé game. We obtain similar results for t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999